A new proof of the Sylvester-Gallai theorem
نویسنده
چکیده
In 1893 J. J. Sylvester [8] posed the following celebrated problem: Given a finite collection of points in the affine plane, not all lying on a line, show that there exists a line which passes through precisely two of the points. Sylvester’s problem was reposed by Erdős in 1944 [4] and later that year a proof was given by Gallai [6]. Since then, many proofs of the Sylvester-Gallai Theorem have been found. Of these proofs, that given by Kelly (as communicated by Coxeter in [2] and [3]) and that attributed to Melchior (as implied in [7]) are particularly elegant. Kelly’s proof uses a simple distance argument while Melchior considers the dual collection of lines and applies Euler’s formula. For more extensive treatments of the Sylvester-Gallai Theorem and its relatives, see [1] and [5]. Given a collection of points, a line passing through just two of the points is commonly referred to as an ordinary line. As in Melchior [7], one can use projective duality to obtain a fully equivalent dual formulation of the theorem, namely that given a collection of n lines in the real projective plane, not all passing through a common point, there must be a point of intersection of
منابع مشابه
Improved rank bounds for design matrices and a new proof of Kelly's theorem
We study the rank of complex sparse matrices in which the supports of different columns have small intersections. The rank of these matrices, called design matrices, was the focus of a recent work by Barak et. al. [BDWY11] in which they were used to answer questions regarding point configurations. In this work we derive near-optimal rank bounds for these matrices and use them to obtain asymptot...
متن کاملSylvester-Gallai Theorems for Complex Numbers and Quaternions
A Sylvester-Gallai (SG) configuration is a finite set S of points such that the line through any two points in S contains a third point of S. According to the Sylvester-Gallai Theorem, an SG configuration in real projective space must be collinear. A problem of Serre (1966) asks whether an SG configuration in a complex projective space must be coplanar. This was proved by Kelly (1986) using a d...
متن کاملSylvester-Gallai Theorem and Metric Betweenness
Sylvester conjectured in 1893 and Gallai proved some forty years later that every finite set S of points in the plane includes two points such that the line passing through them includes either no other point of S or all other points of S. There are several ways of extending the notion of lines from Euclidean spaces to arbitrary metric spaces. We present one of them and conjecture that, with li...
متن کاملThe Sylvester-Gallai Theorem, the Monochrome Line Theorem and Generalizations Report for a Seminar on the Sylvester-Gallai Theorem
متن کامل
The Sylvester-Gallai theorem, colourings and algebra
Our point of departure is the following simple common generalisation of the Sylvester-Gallai theorem and the Motzkin-Rabin theorem: Let S be a finite set of points in the plane, with each point coloured red or blue or with both colours. Suppose that for any two distinct points A, B ∈ S sharing a colour there is a third point C ∈ S, of the other colour, collinear with A and B. Then all the point...
متن کامل